A Repeated Local Search Algorithm for BiClustering of Gene Expression Data
نویسندگان
چکیده
Given a gene expression data matrix where each cell is the expression level of a gene under a certain condition, biclustering is the problem of searching for a subset of genes that coregulate and coexpress only under a subset of conditions. The traditional clustering algorithms cannot be applied for biclustering as one cannot measure the similarity between genes (or rows) and conditions (or columns) by normal geometric similarities. Identifying a network of collaborating genes and a subset of experimental conditions which activate the specific network is a crucial part of the problem. In this paper, the BIClustering problem is solved through a REpeated Local Search algorithm, called BICRELS. The experiments on real datasets show that our algorithm is not only fast but it also significantly outperforms other state-of-the-art algorithms.
منابع مشابه
Application of Cardinality based GRASP to the Biclustering of Gene Expression Data
Biclustering algorithms perform simultaneous row and column clustering of a given data matrix. In gene expression dataset a bicluster is a subset of genes that exhibit similar expression patterns through a subset of conditions. Biclustering is a useful data mining technique for identifying local patterns from gene expression data. In this paper biclusters are identified in two steps. In the fir...
متن کاملBiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization
Biclustering has become an important data mining technique for microarray gene expression analysis and profiling, as it provides a local view of the hidden relationships in data, unlike a global view provided by conventional clustering techniques. This technique, in contrast to the conventional clustering techniques, helps in identifying a subset of the genes and a subset of the experimental co...
متن کاملGene Expression Data Knowledge Discovery using Global and Local Clustering
To understand complex biological systems, the research community has produced huge corpus of gene expression data. A large number of clustering approaches have been proposed for the analysis of gene expression data. However, extracting important biological knowledge is still harder. To address this task, clustering techniques are used. In this paper, hybrid Hierarchical k-Means algorithm is use...
متن کاملGreedy Search-Binary PSO Hybrid for Biclustering Gene Expression Data
As a useful data mining technique biclustering identifies local patterns from gene expression data. A bicluster of a gene expression dataset is a subset of genes which exhibit similar expression patterns along a subset of conditions. In this paper a new method is introduced based on greedy search algorithm combined with the evolutionary technique particle swarm optimization for the identificati...
متن کاملApplication of Greedy Randomized Adaptive Search Procedure to the Biclustering of Gene Expression Data
Microarray technology demands the development of data mining algorithms for extracting useful and novel patterns. A bicluster of a gene expression dataset is a local pattern such that the genes in the bicluster exhibit similar expression patterns through a subset of conditions. In this study biclusters are detected in two steps. In the first step high quality bicluster seeds are generated using...
متن کامل